Maximizing Service Reward for Queues With Deadlines
نویسندگان
چکیده
منابع مشابه
Queues in tandem with customer deadlines and retrials
We study queues in tandem with customer deadlines and retrials. We first consider a 2-queue Markovian system with blocking at the second queue, analyze it, and derive its stability condition. We then study a non-Markovian setting and derive the stability condition for an approximating diffusion, showing its similarity to the former condition. In the Markovian setting, we use probability generat...
متن کاملQueues with Heavy - Tailed Service
We examine the performance and accuracy of simulating M/G/1 queues when the service time is Pareto distributed with shape parameter, alpha, between one and three. Two applications of this problem are in insurance risk and telecommunications. When 2 < alpha <= 3, the theoretical distribution of the sample averages of the queue waiting times is a stable distribution. When alpha <= 2, the mean wai...
متن کاملQueues with service speed adaptations
In this paper, we consider various queueing models in which the server can work at two different service speeds. The speed of the server depends on either the number of customers, or the workload. Our main interest is in the model in which service speed adaptations can only take place at the arrival instants of an external Poisson observer. Using insightful probabilistic arguments we give the s...
متن کاملTolerating faults while maximizing reward
The imprecise computation (IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications. In that model, each task comprises mandatory and optional parts. While allowing greater scheduling flexibility, mandatory parts in the IC model have still hard deadlines and hence they must be completed before the t...
متن کاملAnalysis of Queues with Markovian Service Processes∗
Markovian service process (MSP) is a model similar to the Markovian arrival process (MAP), where arrivals are replaced with service completions. The MSP can represent various queueing models such as vacation models, N -policy models and exceptional service models. We analyze MAP/MSP/1 queues and obtain a new sort of matrix-type factorization of the vector generating function for the stationary ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2018
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2018.2867815